Using Metaheuristic Algorithms to Improve k-Means Clustering: A Comparative Study
نویسندگان
چکیده
منابع مشابه
Comparative Study of k-means and k-Means++ Clustering Algorithms on Crime Domain
This study presents the results of an experimental study of two document clustering techniques which are kmeans and k-means++. In particular, we compare the two main approaches in crime document clustering. The drawback of k-means is that the user needs to define the centroid point. This becomes more critical when dealing with document clustering because each center point represented by a word ...
متن کاملUsing Metaheuristic Algorithms Combined with Clustering Approach to Solve a Sustainable Waste Collection Problem
Sustainability is a monumental issue that should be considered in designing a logistics system. In order to incorporate sustainability concepts in our study, a waste collection problem with economic, environmental, and social objective functions was addressed. The first objective function minimized overall costs of the system, including establishment of depots and treatment facilities. Addressi...
متن کاملA hybrid method to improve Steganography in JPEG images using metaheuristic algorithms
This paper presents a method for improving steganography and enhancing the security using combinatorial Meta-heuristic algorithms. The goal is to achieve an improved PSNR value in order to preserve the image quality in the steganography process. Steganography algorithms, in order to insert message signal information inside the host data, create small changes based on the message signal in the ...
متن کاملComparative Study of K-Means, Pam and Rough K-Means Algorithms Using Cancer Datasets
Data mining is a search for relationship and patterns that exist in large database. Clustering is an important data mining technique. Because of the complexity and the high dimensionality of gene expression data, classification of a disease samples remains a challenge. Hierarchical clustering and partitioning clustering is used to identify patterns of gene expression useful for classification o...
متن کاملA study of K-Means-based algorithms for constrained clustering
The problem of clustering with constraints has received considerable attention in the last decade. Indeed, several algorithms have been proposed, but only a few studies have (partially) compared their performances. In this work, three well-known algorithms for k-means-based clustering with soft constraints — Constrained Vector Quantization Error (CVQE), its variant named LCVQE, and the Metric P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue d'Intelligence Artificielle
سال: 2020
ISSN: 0992-499X,1958-5748
DOI: 10.18280/ria.340307